Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(sum, app(app(cons, x), xs)) → app(app(plus, x), app(sum, xs))
app(size, app(app(node, x), xs)) → app(s, app(sum, app(app(map, size), xs)))
app(app(plus, 0), x) → 0
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))

Q is empty.


QTRS
  ↳ Overlay + Local Confluence

Q restricted rewrite system:
The TRS R consists of the following rules:

app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(sum, app(app(cons, x), xs)) → app(app(plus, x), app(sum, xs))
app(size, app(app(node, x), xs)) → app(s, app(sum, app(app(map, size), xs)))
app(app(plus, 0), x) → 0
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))

Q is empty.

The TRS is overlay and locally confluent. By [15] we can switch to innermost.

↳ QTRS
  ↳ Overlay + Local Confluence
QTRS
      ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(sum, app(app(cons, x), xs)) → app(app(plus, x), app(sum, xs))
app(size, app(app(node, x), xs)) → app(s, app(sum, app(app(map, size), xs)))
app(app(plus, 0), x) → 0
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))

The set Q consists of the following terms:

app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))
app(sum, app(app(cons, x0), x1))
app(size, app(app(node, x0), x1))
app(app(plus, 0), x0)
app(app(plus, app(s, x0)), x1)


Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

APP(app(plus, app(s, x)), y) → APP(s, app(app(plus, x), y))
APP(app(map, f), app(app(cons, x), xs)) → APP(app(cons, app(f, x)), app(app(map, f), xs))
APP(size, app(app(node, x), xs)) → APP(app(map, size), xs)
APP(app(map, f), app(app(cons, x), xs)) → APP(app(map, f), xs)
APP(sum, app(app(cons, x), xs)) → APP(plus, x)
APP(size, app(app(node, x), xs)) → APP(map, size)
APP(sum, app(app(cons, x), xs)) → APP(app(plus, x), app(sum, xs))
APP(size, app(app(node, x), xs)) → APP(s, app(sum, app(app(map, size), xs)))
APP(size, app(app(node, x), xs)) → APP(sum, app(app(map, size), xs))
APP(app(plus, app(s, x)), y) → APP(app(plus, x), y)
APP(app(map, f), app(app(cons, x), xs)) → APP(f, x)
APP(sum, app(app(cons, x), xs)) → APP(sum, xs)
APP(app(plus, app(s, x)), y) → APP(plus, x)
APP(app(map, f), app(app(cons, x), xs)) → APP(cons, app(f, x))

The TRS R consists of the following rules:

app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(sum, app(app(cons, x), xs)) → app(app(plus, x), app(sum, xs))
app(size, app(app(node, x), xs)) → app(s, app(sum, app(app(map, size), xs)))
app(app(plus, 0), x) → 0
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))

The set Q consists of the following terms:

app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))
app(sum, app(app(cons, x0), x1))
app(size, app(app(node, x0), x1))
app(app(plus, 0), x0)
app(app(plus, app(s, x0)), x1)

We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ Overlay + Local Confluence
    ↳ QTRS
      ↳ DependencyPairsProof
QDP
          ↳ EdgeDeletionProof

Q DP problem:
The TRS P consists of the following rules:

APP(app(plus, app(s, x)), y) → APP(s, app(app(plus, x), y))
APP(app(map, f), app(app(cons, x), xs)) → APP(app(cons, app(f, x)), app(app(map, f), xs))
APP(size, app(app(node, x), xs)) → APP(app(map, size), xs)
APP(app(map, f), app(app(cons, x), xs)) → APP(app(map, f), xs)
APP(sum, app(app(cons, x), xs)) → APP(plus, x)
APP(size, app(app(node, x), xs)) → APP(map, size)
APP(sum, app(app(cons, x), xs)) → APP(app(plus, x), app(sum, xs))
APP(size, app(app(node, x), xs)) → APP(s, app(sum, app(app(map, size), xs)))
APP(size, app(app(node, x), xs)) → APP(sum, app(app(map, size), xs))
APP(app(plus, app(s, x)), y) → APP(app(plus, x), y)
APP(app(map, f), app(app(cons, x), xs)) → APP(f, x)
APP(sum, app(app(cons, x), xs)) → APP(sum, xs)
APP(app(plus, app(s, x)), y) → APP(plus, x)
APP(app(map, f), app(app(cons, x), xs)) → APP(cons, app(f, x))

The TRS R consists of the following rules:

app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(sum, app(app(cons, x), xs)) → app(app(plus, x), app(sum, xs))
app(size, app(app(node, x), xs)) → app(s, app(sum, app(app(map, size), xs)))
app(app(plus, 0), x) → 0
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))

The set Q consists of the following terms:

app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))
app(sum, app(app(cons, x0), x1))
app(size, app(app(node, x0), x1))
app(app(plus, 0), x0)
app(app(plus, app(s, x0)), x1)

We have to consider all minimal (P,Q,R)-chains.
We deleted some edges using various graph approximations

↳ QTRS
  ↳ Overlay + Local Confluence
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ EdgeDeletionProof
QDP
              ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

APP(app(plus, app(s, x)), y) → APP(s, app(app(plus, x), y))
APP(app(map, f), app(app(cons, x), xs)) → APP(app(cons, app(f, x)), app(app(map, f), xs))
APP(size, app(app(node, x), xs)) → APP(app(map, size), xs)
APP(size, app(app(node, x), xs)) → APP(map, size)
APP(sum, app(app(cons, x), xs)) → APP(plus, x)
APP(app(map, f), app(app(cons, x), xs)) → APP(app(map, f), xs)
APP(sum, app(app(cons, x), xs)) → APP(app(plus, x), app(sum, xs))
APP(size, app(app(node, x), xs)) → APP(sum, app(app(map, size), xs))
APP(size, app(app(node, x), xs)) → APP(s, app(sum, app(app(map, size), xs)))
APP(app(plus, app(s, x)), y) → APP(app(plus, x), y)
APP(app(map, f), app(app(cons, x), xs)) → APP(f, x)
APP(sum, app(app(cons, x), xs)) → APP(sum, xs)
APP(app(plus, app(s, x)), y) → APP(plus, x)
APP(app(map, f), app(app(cons, x), xs)) → APP(cons, app(f, x))

The TRS R consists of the following rules:

app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(sum, app(app(cons, x), xs)) → app(app(plus, x), app(sum, xs))
app(size, app(app(node, x), xs)) → app(s, app(sum, app(app(map, size), xs)))
app(app(plus, 0), x) → 0
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))

The set Q consists of the following terms:

app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))
app(sum, app(app(cons, x0), x1))
app(size, app(app(node, x0), x1))
app(app(plus, 0), x0)
app(app(plus, app(s, x0)), x1)

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 3 SCCs with 9 less nodes.

↳ QTRS
  ↳ Overlay + Local Confluence
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ EdgeDeletionProof
            ↳ QDP
              ↳ DependencyGraphProof
                ↳ AND
QDP
                    ↳ QDPOrderProof
                  ↳ QDP
                  ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

APP(app(plus, app(s, x)), y) → APP(app(plus, x), y)

The TRS R consists of the following rules:

app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(sum, app(app(cons, x), xs)) → app(app(plus, x), app(sum, xs))
app(size, app(app(node, x), xs)) → app(s, app(sum, app(app(map, size), xs)))
app(app(plus, 0), x) → 0
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))

The set Q consists of the following terms:

app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))
app(sum, app(app(cons, x0), x1))
app(size, app(app(node, x0), x1))
app(app(plus, 0), x0)
app(app(plus, app(s, x0)), x1)

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13]. Here, we combined the reduction pair processor with the A-transformation [14] which results in the following intermediate Q-DP Problem.
Q DP problem:
The TRS P consists of the following rules:

PLUS(s(x), y) → PLUS(x, y)

R is empty.
The set Q consists of the following terms:

map(x0, nil)
map(x0, cons(x1, x2))
sum(cons(x0, x1))
size(node(x0, x1))
plus(0, x0)
plus(s(x0), x1)

We have to consider all minimal (P,Q,R)-chains.


The following pairs can be oriented strictly and are deleted.


APP(app(plus, app(s, x)), y) → APP(app(plus, x), y)
The remaining pairs can at least be oriented weakly.
none
Used ordering: Combined order from the following AFS and order.
PLUS(x1, x2)  =  x1
s(x1)  =  s(x1)

Lexicographic Path Order [19].
Precedence:
trivial

The following usable rules [14] were oriented: none



↳ QTRS
  ↳ Overlay + Local Confluence
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ EdgeDeletionProof
            ↳ QDP
              ↳ DependencyGraphProof
                ↳ AND
                  ↳ QDP
                    ↳ QDPOrderProof
QDP
                        ↳ PisEmptyProof
                  ↳ QDP
                  ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(sum, app(app(cons, x), xs)) → app(app(plus, x), app(sum, xs))
app(size, app(app(node, x), xs)) → app(s, app(sum, app(app(map, size), xs)))
app(app(plus, 0), x) → 0
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))

The set Q consists of the following terms:

app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))
app(sum, app(app(cons, x0), x1))
app(size, app(app(node, x0), x1))
app(app(plus, 0), x0)
app(app(plus, app(s, x0)), x1)

We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS
  ↳ Overlay + Local Confluence
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ EdgeDeletionProof
            ↳ QDP
              ↳ DependencyGraphProof
                ↳ AND
                  ↳ QDP
QDP
                    ↳ QDPOrderProof
                  ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

APP(sum, app(app(cons, x), xs)) → APP(sum, xs)

The TRS R consists of the following rules:

app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(sum, app(app(cons, x), xs)) → app(app(plus, x), app(sum, xs))
app(size, app(app(node, x), xs)) → app(s, app(sum, app(app(map, size), xs)))
app(app(plus, 0), x) → 0
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))

The set Q consists of the following terms:

app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))
app(sum, app(app(cons, x0), x1))
app(size, app(app(node, x0), x1))
app(app(plus, 0), x0)
app(app(plus, app(s, x0)), x1)

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13]. Here, we combined the reduction pair processor with the A-transformation [14] which results in the following intermediate Q-DP Problem.
Q DP problem:
The TRS P consists of the following rules:

SUM(cons(x, xs)) → SUM(xs)

R is empty.
The set Q consists of the following terms:

map(x0, nil)
map(x0, cons(x1, x2))
sum(cons(x0, x1))
size(node(x0, x1))
plus(0, x0)
plus(s(x0), x1)

We have to consider all minimal (P,Q,R)-chains.


The following pairs can be oriented strictly and are deleted.


APP(sum, app(app(cons, x), xs)) → APP(sum, xs)
The remaining pairs can at least be oriented weakly.
none
Used ordering: Combined order from the following AFS and order.
SUM(x1)  =  x1
cons(x1, x2)  =  cons(x2)

Lexicographic Path Order [19].
Precedence:
trivial

The following usable rules [14] were oriented: none



↳ QTRS
  ↳ Overlay + Local Confluence
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ EdgeDeletionProof
            ↳ QDP
              ↳ DependencyGraphProof
                ↳ AND
                  ↳ QDP
                  ↳ QDP
                    ↳ QDPOrderProof
QDP
                        ↳ PisEmptyProof
                  ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(sum, app(app(cons, x), xs)) → app(app(plus, x), app(sum, xs))
app(size, app(app(node, x), xs)) → app(s, app(sum, app(app(map, size), xs)))
app(app(plus, 0), x) → 0
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))

The set Q consists of the following terms:

app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))
app(sum, app(app(cons, x0), x1))
app(size, app(app(node, x0), x1))
app(app(plus, 0), x0)
app(app(plus, app(s, x0)), x1)

We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS
  ↳ Overlay + Local Confluence
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ EdgeDeletionProof
            ↳ QDP
              ↳ DependencyGraphProof
                ↳ AND
                  ↳ QDP
                  ↳ QDP
QDP
                    ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

APP(app(map, f), app(app(cons, x), xs)) → APP(f, x)
APP(size, app(app(node, x), xs)) → APP(app(map, size), xs)
APP(app(map, f), app(app(cons, x), xs)) → APP(app(map, f), xs)

The TRS R consists of the following rules:

app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(sum, app(app(cons, x), xs)) → app(app(plus, x), app(sum, xs))
app(size, app(app(node, x), xs)) → app(s, app(sum, app(app(map, size), xs)))
app(app(plus, 0), x) → 0
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))

The set Q consists of the following terms:

app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))
app(sum, app(app(cons, x0), x1))
app(size, app(app(node, x0), x1))
app(app(plus, 0), x0)
app(app(plus, app(s, x0)), x1)

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


APP(app(map, f), app(app(cons, x), xs)) → APP(f, x)
APP(size, app(app(node, x), xs)) → APP(app(map, size), xs)
APP(app(map, f), app(app(cons, x), xs)) → APP(app(map, f), xs)
The remaining pairs can at least be oriented weakly.
none
Used ordering: Combined order from the following AFS and order.
APP(x1, x2)  =  x2
app(x1, x2)  =  app(x1, x2)
cons  =  cons
node  =  node

Lexicographic Path Order [19].
Precedence:
trivial

The following usable rules [14] were oriented: none



↳ QTRS
  ↳ Overlay + Local Confluence
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ EdgeDeletionProof
            ↳ QDP
              ↳ DependencyGraphProof
                ↳ AND
                  ↳ QDP
                  ↳ QDP
                  ↳ QDP
                    ↳ QDPOrderProof
QDP
                        ↳ PisEmptyProof

Q DP problem:
P is empty.
The TRS R consists of the following rules:

app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(sum, app(app(cons, x), xs)) → app(app(plus, x), app(sum, xs))
app(size, app(app(node, x), xs)) → app(s, app(sum, app(app(map, size), xs)))
app(app(plus, 0), x) → 0
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))

The set Q consists of the following terms:

app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))
app(sum, app(app(cons, x0), x1))
app(size, app(app(node, x0), x1))
app(app(plus, 0), x0)
app(app(plus, app(s, x0)), x1)

We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.